normal order reduction - определение. Что такое normal order reduction
Diclib.com
Словарь ChatGPT
Введите слово или словосочетание на любом языке 👆
Язык:

Перевод и анализ слов искусственным интеллектом ChatGPT

На этой странице Вы можете получить подробный анализ слова или словосочетания, произведенный с помощью лучшей на сегодняшний день технологии искусственного интеллекта:

  • как употребляется слово
  • частота употребления
  • используется оно чаще в устной или письменной речи
  • варианты перевода слова
  • примеры употребления (несколько фраз с переводом)
  • этимология

Что (кто) такое normal order reduction - определение

STRATEGY USED BY PROGRAMMING LANGUAGES TO DETERMINE TWO THINGS—WHEN TO EVALUATE THE ARGUMENTS OF A FUNCTION CALL AND WHAT KIND OF VALUE TO PASS TO THE FUNCTION
Eager evaluation; Call-by-something; Call by reference; Call By Reference; Call by value; Call by something; Call by name; Strict evaluation; Cbpv; Call-by-name; Call-by-need; Call-by-value; Call-by-result; Call-by-reference; Call by result; Call-by-value-result; Call by Name; Pass-by-reference; Return-by-reference; Comparison of normal-order evaluation and applicative-order evaluation; Applicative-order evaluation; Normal-order evaluation; Applicative order; Applicative order evaluation; Normal order evaluation; Non-strict evaluation; Pass by reference; Pass-by-value; Non-strict semantics; Eager execution; Lazy language; Avaliação ansiosa; Avaliacao ansiosa; Call by value-result; Call by value result; Call by value/result; Pass by value; Pass By Value; Pass-By-Value; Pass By Reference; Pass-By-Reference; Pass By Name; Pass-By-Name; Pass-By-Value Evaluation; Pass-By-Reference Evaluation; Pass-By-Name Evaluation; Call-By-Value Evaluation; Call-By-Reference Evaluation; All-By-Name Evaluation; Normal order reduction; Call by object; Call-by-object; Called by value; Call by sharing; Call by future; Call-by-sharing; Call by copy-restore; Call by address; Call by macro expansion; Greedy evaluation

normal order reduction         
Under this evaluation strategy an expression is evaluated by reducing the leftmost outermost redex first. This method will terminate for any expression for which termination is possible, whereas applicative order reduction may not. This method is equivalent to passing arguments unevaluated because arguments are initially to the right of functions applied to them. See also computational adequacy theorem.
Normal order         
TYPE OF OPERATOR ORDERING IN QUANTUM FIELD THEORY
Wick ordering; Wick ordered; Normal-order; Normal ordering; Normal order (quantum physics); Normal order (quantum field theory)
In quantum field theory a product of quantum fields, or equivalently their creation and annihilation operators, is usually said to be normal ordered (also called Wick order) when all creation operators are to the left of all annihilation operators in the product. The process of putting a product into normal order is called normal ordering (also called Wick ordering).
Dimensionality reduction         
  • A visual depiction of the resulting LDA projection for a set of 2D points.
  • A visual depiction of the resulting PCA projection for a set of 2D points.
PROCESS OF REDUCING THE NUMBER OF RANDOM VARIABLES UNDER CONSIDERATION
Dimension reduction; Dimensionality Reduction; Dimensionality reduction algorithm; Linear dimensionality reduction
Dimensionality reduction, or dimension reduction, is the transformation of data from a high-dimensional space into a low-dimensional space so that the low-dimensional representation retains some meaningful properties of the original data, ideally close to its intrinsic dimension. Working in high-dimensional spaces can be undesirable for many reasons; raw data are often sparse as a consequence of the curse of dimensionality, and analyzing the data is usually computationally intractable (hard to control or deal with).

Википедия

Evaluation strategy

In a programming language, an evaluation strategy is a set of rules for evaluating expressions. The term is often used to refer to the more specific notion of a parameter-passing strategy that defines the kind of value that is passed to the function for each parameter (the binding strategy) and whether to evaluate the parameters of a function call, and if so in what order (the evaluation order). The notion of reduction strategy is distinct, although some authors conflate the two terms and the definition of each term is not widely agreed upon.

To illustrate, executing a function call f(a,b) may first evaluate the arguments a and b, store the results in references or memory locations ref_a and ref_b, then evaluate the function's body with those references passed in. This gives the function the ability to look up the argument values, to modify them via assignment as if they were local variables, and to return values via the references. This is the call-by-reference evaluation strategy.

Evaluation strategy is part of the semantics of the programming language definition. Some languages, such as PureScript, have variants with different evaluation strategies. Some declarative languages, such as Datalog, support multiple evaluation strategies. Some languages define a calling convention.